1,831 research outputs found

    Cursed to the Trees, Enchanted by the Woods: Sweeney Astray

    Get PDF
    Drawing on Jane Bennett’s theory of “crossings and enchantment”, this essay considers interspecies transformations in Seamus Heaney’s Sweeney Astray (1983). As a bird-man, Mad King Sweeney discovers that the arboreal environment is a vibrantly interstitial space in which paganism and Christianity coexist. By negotiating this liminal space, he opens himself to forms of attachment and enchantment that radically ameliorate his accursed existence in the trees

    On plane subgraphs of complete topological drawings

    Get PDF
    Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a common endpoint or at a proper crossing. In this paper we study properties of maximal plane subgraphs of simple drawings Dnof the complete graph Knon n vertices. Our main structural result is that maximal plane subgraphs are 2-connected and what we call essentially 3-edge-connected. Besides, any maximal plane subgraph contains at least [3n/2] edges. We also address the problem of obtaining a plane subgraph of Dnwith the maximum number of edges, proving that this problem is NP-complete. However, given a plane spanning connected subgraph of Dn, a maximum plane augmentation of this subgraph can be found in O(n3) time. As a side result, we also show that the problem of finding a largest compatible plane straight-line graph of two labeled point sets is NP-complete. © 2021 Society of Mathematicians, Physicists and Astronomers of Slovenia. All rights reserved

    Effects of aging on identifying emotions conveyed by point-light walkers

    Get PDF
    M.G. was supported by EC FP7 HBP (grant 604102), PITN-GA-011-290011 (ABC) FP7-ICT-2013-10/ 611909 (KOROIBOT), and by GI 305/4-1 and KA 1258/15-1, and BMBF, FKZ: 01GQ1002A. K.S.P. was supported by a BBSRC New Investigator Grant. A.B.S. and P.J.B. were supported by an operating grant (528206) from the Canadian Institutes for Health Research. The authors also thank Donna Waxman for her valuable help in data collection for all experiments described here.Peer reviewedPostprin

    Flip Distance Between Triangulations of a Simple Polygon is NP-Complete

    Full text link
    Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the smallest number of flips required to transform one triangulation into the other. For the special case of convex polygons, the problem of determining the shortest flip distance between two triangulations is equivalent to determining the rotation distance between two binary trees, a central problem which is still open after over 25 years of intensive study. We show that computing the flip distance between two triangulations of a simple polygon is NP-complete. This complements a recent result that shows APX-hardness of determining the flip distance between two triangulations of a planar point set.Comment: Accepted versio

    történeti dráma 5 felvonásban - irta: Sardou Viktor - francziából forditotta: Paulay Ede és Szerdahelyi Kálmán

    Get PDF
    Debreczeni Szinház. Kedd, 1881. évi november hó 15-kán. Krecsányi Ignácz igazgatása alatti dráma-, vigjáték-, népszinmű- és operette-szintársulat által, Abonyi Gyula jutalomjátékaul.Debreceni Egyetem Egyetemi és Nemzeti Könyvtá

    Wandlungen der Gewalt von Frauen im Sport: psychische und gesellschaftliche Entwicklungstrends sozialer Kanons im Frauensport

    Full text link
    • …
    corecore